calculation of computational complexity for radix-2p fast fourier transform algorithms for medical signals

due to its simplicity radix-2 is a popular algorithm to implement fast fourier transform. radix - 2 p algorithms have the same order of computational complexity as higher radices algorithms, but still retain the simplicity of radix-2 . by defining a new concept, twiddle factor template , in this paper we propose a method for exact calculation of multiplicative complexity for radix-2 p algorithms. the methodology is described for radix-2 , radix-2 2 and radix-2 3 algorithms. results show that radix-2 2 and radix-2 3 have significantly less computational complexity compared to radix-2 . another interesting result is that while the number of complex multiplications in radix-2 3 algorithm is slightly more than radix-2 2 , the number of real multiplications for radix-2 3 is less than radix-2 2 .